Reduction of delayed optimal control problems to nondelayed problems

A method is exhibited which transforms a large class of optimal control problems with fixed delays to nondelayed problems, thus permitting classical results to be used in their analysis.     

Asymptotically decoupled systems

In this paper, two linear-quadratic systems are shown to be asymptotically decoupled. We obtain the steady-state term and the first-order transient term of optimal controls. We also obtain an estimate of the rate at which the first-order transient term diminishes and approaches zero.     

EOL and ETOL array languages

In this paper we study the families of ETOL and EOL array languages. Standard forms for ETOL and EOL array systems are defined and closure properties of the families are studied. Relations of these families with other developmental array languages and other array languages are studied.     

On the discrete-time regulator problem in infinite-dimensional spaces

The linear, discrete-time regulator problem is considered in infinite-dimensional spaces without posing in advance any positivity conditions on quadratic criterion. The convergence of the finite-time optimum solution is studied, when time increases to infinity with a stable, stabilizable, and detectable system.The author thanks Professors P. Karttunen and H. Koivo for helpful discussions regarding this note.     

Deterministic optimal control,given only a partial observation of the initial state

The deterministic linear-system, quadratic-cost optimal control problem is considered when the only state information available is a partial linear observation of the initial statex ₀. Thus, it is only known that the initial condition belongs to a particular linear variety. A control function is found which is optimal, in the sense (roughly) that (i) it can be computed using available information aboutx ₀ and (ii) no other control function which can be found using that information gives lower cost than it does for every initial condition that could have given rise to the information. The optimal control can be found easily from the conventional Riccati equation of optimal control. Applications are considered in the presence of unknown exponential disturbances and to the case with a sequence of partial state observations.     

Self consistent modified extended Hückel (SC-MEH) calculations on heavy metal systems. I. Platinum(II) tetragonal planar complexes with and without relativistic effects

The Self Consistent Modified Extended Hückel molecular orbital method had been applied to several square planar complexes of platinum (II). Calculations including both the limited 5d, 6s, 6p and extended 5s, 5p, 5d, 6s, 6p starting bases for platinum were made. It is shown that in PtCl ₄ ^2– both the nuclear quadrupole moment and minimum total energy vs. bond distance are calculated to be in good agreement with experiment, only with the extended platinum AO basis.Specific inclusion of relativistic parameters via a pseudo-relativistic approximation are shown to have a significant effect on the energy molecular energy levels, however no meaningful rationalization can be made without the simultaneous inclusion of ligand field parameters as well.Supported in part by a grant made available through the Cancer Association of Greater New Orleans. Use of the facilities of the Computer Research Center of the University of New Orleans is gratefully acknowledged.     

The global Markov property for lattice systems

We prove the global Markov property for lattice systems of classical statistical mechanics, with bounded spins and finite range interactions. The method uses the one developed by two of us to prove the global Markov property of Euclidean generalized random fields. The result shows that the systems considered have a transition matrix, which together with a distribution on a hyperplane, describes completely the system.     

A geometric method in nonlinear programming

A differential geometric approach to the constrained function maximization problem is presented. The continuous analogue of the Newton-Raphson method due to Branin for solving a system of nonlinear equations is extended to the case where the system is under-determined. The method is combined with the continuous analogue of the gradient-projection method to obtain a constrained maximization method with enforced constraint restoration. Detailed analysis of the global behavior of both methods is provided. It is shown that the conjugate-gradient algorithm can take advantage of the sparse structure of the problem in the computation of a vector field, which constitutes the main computational task in the methods.This is part of a paper issued as Stanford University, Computer Science Department Report No. STAN-CS-77-643 (Ref. 45), which was presented at the Gatlinburg VII Conference, Asilomar, California, 1977. This work was supported in part by NSF Grant No. NAT BUR OF ECON RES/PO No. 4369 and by Department of Energy Contract No. EY-76-C-02-0016.The main part of this work was presented at the Japan-France Seminar on Functional Analysis and Numerical Analysis, Tokyo, Japan, 1976. The paper was prepared in part while the author was a visitor at the Department of Mathematics, North Carolina State University, Raleigh, North Carolina, 1976–77, and was completed while he was a visitor at the Computer Science Department, Stanford University, Stanford, California, 1977. He acknowledges the hospitality and stimulating environment provided by Professor G. H. Golub, Stanford University, and Professors N. J. Rose and C. D. Meyer, North Carolina State University.     

A new approach to variational CI calculations on systems containing non-interacting molecules

A new method to perform variational CI calculations on systems containing non-interacting molecules is presented.